package com.mystudy.leetcode.problem.string.p_344;

/**
 * @program: infoalgorithm
 * @description: 反转字符串
 * @author: zhouzhilong
 * @create: 2019-07-11 11:29
 **/
public class Solution {

    public void reverseString(char[] s) {
        int t = s.length/2;
        for (int i = 0; i < t; i++) {
            s[i] = (char) (s[s.length-1-i]+s[i]-(s[s.length-1-i] = s[i]));
        }

    }
}
